Distributed minimum spanning tree
19.6 KB of readable text · 12 parts
Select a part to read:
• Part 1 — 1.1 KB Introduction
• Part 2 — 1.5 KB Contents
• Part 3 — 1.8 KB Overview, MST in message-passing model
• Part 4 — 1.9 KB GHS algorithm, Assumptions, Properties of MSTs
• Part 5 — 2.0 KB Description of the algorithm
• Part 10 — 1.4 KB Progress property, Approximation algorithms
• Part 11 — 1.7 KB References